0.00/0.03	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.05	% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM
0.13/0.39	% Computer : n010.cluster.edu
0.13/0.39	% Model    : x86_64 x86_64
0.13/0.39	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.39	% Memory   : 8046.5625MB
0.13/0.39	% OS       : Linux 6.8.0-71-generic
0.13/0.39	% CPULimit : 1440
0.13/0.39	% WCLimit  : 180
0.13/0.40	% DateTime : Mon Jul 27 10:04:49 UTC 2026
0.13/0.40	% CPUTime  : 
0.13/0.40	Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM
0.13/0.47	Running higher-order theorem proving
0.22/0.49	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.hZdbbRZxoi/E---3.1_973801.p
0.22/0.52	% Version: 3.5.1-ho
0.22/0.52	% Preprocessing class: HSSSSMSSSSSNFFN.
0.22/0.52	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.22/0.52	% Starting new_ho_10 with 900s (5) cores
0.22/0.52	% Starting ho_unfolding_6 with 180s (1) cores
0.22/0.52	% Starting sh4l with 180s (1) cores
0.22/0.52	% Starting ehoh_best_nonlift_rwall with 180s (1) cores
0.22/0.52	% new_ho_10 with pid 973814 completed with status 0
0.22/0.52	% Result found by new_ho_10
0.22/0.52	% Preprocessing class: HSSSSMSSSSSNFFN.
0.22/0.52	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.22/0.52	% Starting new_ho_10 with 900s (5) cores
0.22/0.52	% (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
0.22/0.52	% No SInE strategy applied
0.22/0.52	% Search class: HHUNS-FFSF21-MFFFFFNN
0.22/0.52	% Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
0.22/0.52	% Starting SubtermCWHack with 91s (1) cores
0.22/0.52	% Starting new_ho_10 with 541s (1) cores
0.22/0.52	% Starting sh5l with 91s (1) cores
0.22/0.52	% Starting new_bool_1 with 91s (1) cores
0.22/0.52	% Starting new_bool_2 with 86s (1) cores
0.22/0.52	% sh5l with pid 973820 completed with status 0
0.22/0.52	% Result found by sh5l
0.22/0.52	% Preprocessing class: HSSSSMSSSSSNFFN.
0.22/0.52	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.22/0.52	% Starting new_ho_10 with 900s (5) cores
0.22/0.52	% (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
0.22/0.52	% No SInE strategy applied
0.22/0.52	% Search class: HHUNS-FFSF21-MFFFFFNN
0.22/0.52	% Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
0.22/0.52	% Starting SubtermCWHack with 91s (1) cores
0.22/0.52	% Starting new_ho_10 with 541s (1) cores
0.22/0.52	% Starting sh5l with 91s (1) cores
0.22/0.52	% Preprocessing time       : 0.001 s
0.22/0.52	% Presaturation interreduction done
0.22/0.52	
0.22/0.52	% Proof found!
0.22/0.52	% SZS status Theorem
0.22/0.52	% SZS output start CNFRefutation
0.22/0.52	thf(decl_23, type, nt: $i > $i).
0.22/0.52	thf(decl_24, type, imp: $i > $i > $i).
0.22/0.52	thf(decl_25, type, cT: $i > $o).
0.22/0.52	thf(decl_26, type, esk1_0: $i).
0.22/0.52	thf(cLCL077_1, conjecture, ~(((((![X1:$i, X2:$i]:((cT @ (imp @ X1 @ (imp @ X2 @ X1))))&![X1:$i, X2:$i, X3:$i]:((cT @ (imp @ (imp @ X1 @ (imp @ X2 @ X3)) @ (imp @ (imp @ X1 @ X2) @ (imp @ X1 @ X3))))))&?[X4:$i]:(~((cT @ (imp @ (nt @ (nt @ X4)) @ X4)))))&![X1:$i, X2:$i]:((cT @ (imp @ (imp @ (nt @ X1) @ (nt @ X2)) @ (imp @ X2 @ X1)))))&![X1:$i, X2:$i]:((~((cT @ (imp @ X1 @ X2)))|(cT @ X2)|~((cT @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.hZdbbRZxoi/E---3.1_973801.p', cLCL077_1)).
0.22/0.52	thf(c_0_1, negated_conjecture, ~(~(((((![X1:$i, X2:$i]:((cT @ (imp @ X1 @ (imp @ X2 @ X1))))&![X1:$i, X2:$i, X3:$i]:((cT @ (imp @ (imp @ X1 @ (imp @ X2 @ X3)) @ (imp @ (imp @ X1 @ X2) @ (imp @ X1 @ X3))))))&?[X4:$i]:(~((cT @ (imp @ (nt @ (nt @ X4)) @ X4)))))&![X1:$i, X2:$i]:((cT @ (imp @ (imp @ (nt @ X1) @ (nt @ X2)) @ (imp @ X2 @ X1)))))&![X1:$i, X2:$i]:((~((cT @ (imp @ X1 @ X2)))|(cT @ X2)|~((cT @ X1))))))), inference(assume_negation,[status(cth)],[cLCL077_1])).
0.22/0.52	thf(c_0_2, negated_conjecture, ~(~(((((![X1:$i, X2:$i]:((cT @ (imp @ X1 @ (imp @ X2 @ X1))))&![X1:$i, X2:$i, X3:$i]:((cT @ (imp @ (imp @ X1 @ (imp @ X2 @ X3)) @ (imp @ (imp @ X1 @ X2) @ (imp @ X1 @ X3))))))&?[X4:$i]:(~(cT @ (imp @ (nt @ (nt @ X4)) @ X4))))&![X1:$i, X2:$i]:((cT @ (imp @ (imp @ (nt @ X1) @ (nt @ X2)) @ (imp @ X2 @ X1)))))&![X1:$i, X2:$i]:((~(cT @ (imp @ X1 @ X2))|(cT @ X2)|~(cT @ X1)))))), inference(fof_simplification,[status(thm)],[c_0_1])).
0.22/0.52	thf(c_0_3, negated_conjecture, ![X15:$i, X16:$i, X17:$i, X18:$i, X19:$i, X21:$i, X22:$i, X23:$i, X24:$i]:((((((cT @ (imp @ X15 @ (imp @ X16 @ X15)))&(cT @ (imp @ (imp @ X17 @ (imp @ X18 @ X19)) @ (imp @ (imp @ X17 @ X18) @ (imp @ X17 @ X19)))))&~(cT @ (imp @ (nt @ (nt @ esk1_0)) @ esk1_0)))&(cT @ (imp @ (imp @ (nt @ X21) @ (nt @ X22)) @ (imp @ X22 @ X21))))&(~(cT @ (imp @ X23 @ X24))|(cT @ X24)|~(cT @ X23)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])).
0.22/0.52	thf(c_0_4, negated_conjecture, ![X2:$i, X1:$i]:(((cT @ X2)|~((cT @ (imp @ X1 @ X2)))|~((cT @ X1)))), inference(split_conjunct,[status(thm)],[c_0_3])).
0.22/0.52	thf(c_0_5, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:((cT @ (imp @ (imp @ X1 @ (imp @ X2 @ X3)) @ (imp @ (imp @ X1 @ X2) @ (imp @ X1 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_3])).
0.22/0.52	thf(c_0_6, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(((cT @ (imp @ (imp @ X1 @ X2) @ (imp @ X1 @ X3)))|~((cT @ (imp @ X1 @ (imp @ X2 @ X3)))))), inference(spm,[status(thm)],[c_0_4, c_0_5])).
0.22/0.52	thf(c_0_7, negated_conjecture, ![X2:$i, X1:$i]:((cT @ (imp @ X1 @ (imp @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_3])).
0.22/0.52	thf(c_0_8, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(((cT @ (imp @ X1 @ X2))|~((cT @ (imp @ X1 @ (imp @ X3 @ X2))))|~((cT @ (imp @ X1 @ X3))))), inference(spm,[status(thm)],[c_0_4, c_0_6])).
0.22/0.52	thf(c_0_9, negated_conjecture, ![X1:$i, X2:$i]:(((cT @ (imp @ X1 @ X2))|~((cT @ X2)))), inference(spm,[status(thm)],[c_0_4, c_0_7])).
0.22/0.52	thf(c_0_10, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((cT @ (imp @ X1 @ X2))|~((cT @ (imp @ X1 @ X3)))|~((cT @ (imp @ X3 @ X2))))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
0.22/0.52	thf(c_0_11, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((cT @ (imp @ X1 @ X2))|~((cT @ (imp @ (imp @ X3 @ X1) @ X2))))), inference(spm,[status(thm)],[c_0_10, c_0_7])).
0.22/0.52	thf(c_0_12, negated_conjecture, ![X2:$i, X1:$i]:((cT @ (imp @ (imp @ (nt @ X1) @ (nt @ X2)) @ (imp @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_3])).
0.22/0.52	thf(c_0_13, negated_conjecture, ![X1:$i, X2:$i]:((cT @ (imp @ (nt @ X1) @ (imp @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.22/0.52	thf(c_0_14, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((cT @ (imp @ (nt @ X1) @ X2))|~((cT @ (imp @ (imp @ X1 @ X3) @ X2))))), inference(spm,[status(thm)],[c_0_10, c_0_13])).
0.22/0.52	thf(c_0_15, negated_conjecture, ![X2:$i, X1:$i]:((cT @ (imp @ (nt @ (nt @ X1)) @ (imp @ X2 @ X1)))), inference(spm,[status(thm)],[c_0_14, c_0_12])).
0.22/0.52	thf(c_0_16, negated_conjecture, ![X1:$i, X2:$i]:(((cT @ (imp @ (nt @ (nt @ X1)) @ X1))|~((cT @ (imp @ (nt @ (nt @ X1)) @ X2))))), inference(spm,[status(thm)],[c_0_8, c_0_15])).
0.22/0.52	thf(c_0_17, negated_conjecture, ~((cT @ (imp @ (nt @ (nt @ esk1_0)) @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_3])).
0.22/0.52	thf(c_0_18, negated_conjecture, ![X1:$i]:((cT @ (imp @ (nt @ (nt @ X1)) @ X1))), inference(spm,[status(thm)],[c_0_16, c_0_7])).
0.22/0.52	thf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_18])]), ['proof']).
0.22/0.52	% SZS output end CNFRefutation
0.22/0.52	% Parsed axioms                        : 4
0.22/0.52	% Removed by relevancy pruning/SinE    : 0
0.22/0.52	% Initial clauses                      : 8
0.22/0.52	% Removed in clause preprocessing      : 3
0.22/0.52	% Initial clauses in saturation        : 5
0.22/0.52	% Processed clauses                    : 58
0.22/0.52	% ...of these trivial                  : 0
0.22/0.52	% ...subsumed                          : 18
0.22/0.52	% ...remaining for further processing  : 40
0.22/0.52	% Other redundant clauses eliminated   : 0
0.22/0.52	% Clauses deleted for lack of memory   : 0
0.22/0.52	% Backward-subsumed                    : 0
0.22/0.52	% Backward-rewritten                   : 3
0.22/0.52	% Generated clauses                    : 118
0.22/0.52	% ...of the previous two non-redundant : 101
0.22/0.52	% ...aggressively subsumed             : 0
0.22/0.52	% Contextual simplify-reflections      : 0
0.22/0.52	% Paramodulations                      : 118
0.22/0.52	% Factorizations                       : 0
0.22/0.52	% NegExts                              : 0
0.22/0.52	% Equation resolutions                 : 0
0.22/0.52	% Disequality decompositions           : 0
0.22/0.52	% Total rewrite steps                  : 12
0.22/0.52	% ...of those cached                   : 5
0.22/0.52	% Propositional unsat checks           : 0
0.22/0.52	%    Propositional check models        : 0
0.22/0.52	%    Propositional check unsatisfiable : 0
0.22/0.52	%    Propositional clauses             : 0
0.22/0.52	%    Propositional clauses after purity: 0
0.22/0.52	%    Propositional unsat core size     : 0
0.22/0.52	%    Propositional preprocessing time  : 0.000
0.22/0.52	%    Propositional encoding time       : 0.000
0.22/0.52	%    Propositional solver time         : 0.000
0.22/0.52	%    Success case prop preproc time    : 0.000
0.22/0.52	%    Success case prop encoding time   : 0.000
0.22/0.52	%    Success case prop solver time     : 0.000
0.22/0.52	% Current number of processed clauses  : 32
0.22/0.52	%    Positive orientable unit clauses  : 8
0.22/0.52	%    Positive unorientable unit clauses: 0
0.22/0.52	%    Negative unit clauses             : 2
0.22/0.52	%    Non-unit-clauses                  : 22
0.22/0.52	% Current number of unprocessed clauses: 52
0.22/0.52	% ...number of literals in the above   : 103
0.22/0.52	% Current number of archived formulas  : 0
0.22/0.52	% Current number of archived clauses   : 8
0.22/0.52	% Clause-clause subsumption calls (NU) : 134
0.22/0.52	% Rec. Clause-clause subsumption calls : 134
0.22/0.52	% Non-unit clause-clause subsumptions  : 21
0.22/0.52	% Unit Clause-clause subsumption calls : 13
0.22/0.52	% Rewrite failures with RHS unbound    : 0
0.22/0.52	% BW rewrite match attempts            : 34
0.22/0.52	% BW rewrite match successes           : 3
0.22/0.52	% Condensation attempts                : 58
0.22/0.52	% Condensation successes               : 3
0.22/0.52	% Termbank termtop insertions          : 3300
0.22/0.52	% Search garbage collected termcells   : 97
0.22/0.52	
0.22/0.52	% -------------------------------------------------
0.22/0.52	% User time                : 0.004 s
0.22/0.52	% System time              : 0.006 s
0.22/0.52	% Total time               : 0.010 s
0.22/0.52	% Maximum resident set size: 3632 pages
0.22/0.52	
0.22/0.52	% -------------------------------------------------
0.22/0.52	% User time                : 0.024 s
0.22/0.52	% System time              : 0.020 s
0.22/0.52	% Total time               : 0.043 s
0.22/0.52	% Maximum resident set size: 4864 pages
0.22/0.52	% E exiting
0.22/0.52	EOF